Borda Working Papers
نویسنده
چکیده
منابع مشابه
The Borda count in n-dimensional issue space
We provide a natural extension of the Borda count to the n-dimensional spatial context, an algorithm to find the spatial Borda winner based on the notion of an inverse Borda count, the result that the Borda winner and the Condorcet winner coincide in unidimensional space when all alternatives on a line are feasible, results that show that in multi-dimensional space the Borda winner and the Cond...
متن کاملA BORDA MEASURE FOR SOCIAL CHOICE FUNCTIONS by
The question addressed in this paper is the order of magnitude of the difference between the Borda rule and any given social choice function. A social choice function is a mapping that associates a subset of alternatives to any profile of individual preferences. The Borda rule consists in asking voters to order all alternatives, knowing that the last one in their ranking will receive a score of...
متن کاملAn Axiomatic Characterization of the Borda Mean Rule
Given a preference profile, a social dichotomy function partitions the set of alternatives into a set of approved alternatives and a set of disapproved alternatives. The Borda mean rule approves all alternatives with above-average Borda score, and disapproves alternatives with below-average Borda score. We show that the Borda mean rule is the unique social dichotomy function satisfying neutrali...
متن کاملبهبود روش تصمیمگیری گروهی بوردا با کمک محاسبات نرم
Borda count is a well-known social choice method, and is frequently used for group decision making problems. However it does not consider the optimism/pessimism view of the director, which has a great effect on the group decisions. Therefore in the present study, we extend the Borda method by using the Ordered Weighted Averaging (OWA) operator to consider the risk attitudinal characteristics....
متن کاملComplexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson’s and Baldwin’s voting rules, which are based on Borda voting. We argue that these rules have a number of desirable computational properties. For unweighted Borda voting, we prove that it is NP-hard for a coalition of two manipulators to compute a manipulation. This resolves a long-standi...
متن کامل